Quantum Programs With Classical Output Streams: (Extended Abstract)
نویسنده
چکیده
We show how to model the semantics of quantum programs that give classical output during their execution. That is, in our model even non-terminating programs may have output. The modelling interprets a program as a measurement process on the machines state, with the classical output as measurement result. The semantics presented here are fully abstract in the sense that two programs are equal in semantics if and only if they give the same outputs in any composition.
منابع مشابه
Quantum Programs with Classical Output Streams
We show how to model the semantics of quantum programs that give classical output during their execution. That is, in our model even non-terminating programs may have output. The modelling interprets a program as a measurement process on the machines state, with the classical output as measurement result. The semantics presented here are fully abstract in the sense that two programs are equal i...
متن کاملQuantum One-Time Programs - (Extended Abstract)
One-time programs are modelled after a black box that allows a single evaluation of a function, and then self-destructs. Because software can, in principle, be copied, general one-time programs exists only in the hardware token model: it has been shown that any function admits a one-time program as long as we assume access to physical devices called one-time memories. Quantum information, with ...
متن کاملClassical programmability is enough for quantum circuits universality in approximate sense
Extended Abstract Classical programmability is enough for quantum circuits universality in approximate sense It was shown by M. A. Nielsen and I. L Chuang [1], that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use prob-abilistic gate arrays instead. In present work is shown, that if to us...
متن کاملAdditivity of the Classical Capacity of Entanglement-Breaking Quantum Channels
Abstract We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (fo...
متن کاملIteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract)
In this extended abstract, we discuss the use of iteratively-supported formulas (ISFs) as a basis for computing strongly-supported models for Kleene Answer Set Programs (ASP ). ASP programs have a syntax identical to classical ASP programs. The semantics of ASP programs is based on the use of Kleene three-valued logic and strongly-supported models. For normal ASP programs, their strongly suppor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 170 شماره
صفحات -
تاریخ انتشار 2007